Yet Another Characterization of Strong Equivalence
نویسندگان
چکیده
Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas. 1998 ACM Subject Classification D.1.6 Logic Programming, I.2.3 Deduction and Theorem Proving
منابع مشابه
Normal Forms in Combinatory Logic
Let R be a convergent term rewriting system, and let CR-equality on (simply typed) combinatory logic terms be the equality induced by βηRequality on terms of the (simply typed) lambda calculus under any of the standard translations between these two frameworks for higher-order reasoning. We generalize the classical notion of strong reduction to a reduction relation which generates CR-equality a...
متن کاملSELP - A System for Studying Strong Equivalence between Logic Programs
This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. This allows us to investigate some interesting properties of strong equivalence, such as a complete characterization for a rule to be strongly e...
متن کاملDevelopment and Characterization of Synthetic Tissue- Equivalent Material for CT Imaging Applications
Introduction: The use of a simple tissue analog material in the fabrication of medical computed tomography (CT) imaging phantoms has great potential to help researchers. The purpose of the present study is to develop new gel tissue-equivalent materials and determine whether their CT numbers and relative electron densities vary in CT images obtained by scans at different energie...
متن کاملCharacterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions
Ordered disjunctions have recently been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answer-set semantics, but comes in different flavors, depending on the particular notion of preference associated to the disjunction connective. While in standard answer-set programmin...
متن کاملNotions of Strong Equivalence for Logic Programs with Ordered Disjunction
Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answer-set semantics, but comes in different variants, depending on the particular interpretation of preference aggregation associated to the ordered disjunction connective. While in standard a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011